Note on non-uniform bin packing games
نویسندگان
چکیده
A non-uniform bin packing game is an N-person cooperative game, where the set N is defined by k bins of capacities b1, . . . , bk and n items of sizes a1, . . . , an. The objective function v of a coalition is the maximum total value of the items of that coalition which can be packed to the bins of that coalition. We investigate the taxation model of Faigle and Kern (1993) [2] and show that the 1/2-core is always nonempty for such bin packing games. If all items have size strictly larger than 1/3, we show that the 5/12-core is always non-empty. Finally, we investigate the limiting case k → ∞, thereby extending the main result in Faigle and Kern (1998) [3] to the non-uniform case. © 2012 Elsevier B.V. All rights reserved.
منابع مشابه
On Colorful Bin Packing Games
We consider colorful bin packing games in which selfish players control a set of items which are to be packed into a minimum number of unit capacity bins. Each item has one of m ≥ 2 colors and cannot be packed next to an item of the same color. All bins have the same unitary cost which is shared among the items it contains, so that players are interested in selecting a bin of minimum shared cos...
متن کاملExtending Two-Dimensional Bin Packing Problem: Consideration of Priority for Items
In this paper a two-dimensional non-oriented guillotine bin packing problem is studied when items have different priorities. Our objective is to maximize the total profit which is total revenues minus costs of used bins and wasted area. A genetic algorithm is developed to solve this problem where a new coding scheme is introduced. To evaluate the performance of the proposed GA, first an upper b...
متن کاملOn some approximately balanced combinatorial cooperative games
A model of taxation for cooperative n-person games is introduced where proper coalitions are taxed proportionally to their value. Games with non-empty core under taxation at rate e are a-balanced. Sharp bounds on e in matching games on (not necessarily bipartite) graphs are established. Upper and lower bounds on the smallest e in bin packing games are derived and euclidean random TSP games are ...
متن کاملPerfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing
We consider the one-dimensional bin packing problem under the discrete uniform distributions U{j, k}, 1 ≤ j ≤ k − 1, in which the bin capacity is k and item sizes are chosen uniformly from the set {1, 2, . . . , j}. Note that for 0 < u = j/k ≤ 1 this is a discrete version of the previously studied continuous uniform distribution U(0, u], where the bin capacity is 1 and item sizes are chosen uni...
متن کاملBin Packing Games
The bin packing game is a cooperative N -person game, where the set of players consists of k bins, each has capacity 1 and n items of sizes a1, a2, ⋅ ⋅ ⋅ , an, w.l.o.g, we assume 0 ≤ ai ≤ 1 for all 1 ≤ i ≤ n. The value function of a coalition of bins and items is the maximum total size of items in the coalition that can be packed into the bins of the coalition. A typical question of the bin pac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 165 شماره
صفحات -
تاریخ انتشار 2014